Generating Function for $K$-Restricted Jagged Partitions
نویسندگان
چکیده
منابع مشابه
Generating Function for K-Restricted Jagged Partitions
We present a natural extension of Andrews’ multiple sums counting partitions of the form (λ1, · · · , λm) with λi ≥ λi+k−1 + 2. The multiple sum that we construct is the generating function for the so-called K-restricted jagged partitions. A jagged partition is a sequence of non-negative integers (n1, n2, · · · , nm) with nm ≥ 1 subject to the weakly decreasing conditions ni ≥ ni+1− 1 and ni ≥ ...
متن کاملJagged partitions
By jagged partitions we refer to an ordered collection of non-negative integers (n 1 , n 2 , · · · , n m) with n m ≥ p for some positive integer p, further subject to some weakly decreasing conditions that prevent them for being genuine partitions. The case analyzed in greater detail here corresponds to p = 1 and the following conditions n i ≥ n i+1 − 1 and n i ≥ n i+2. A number of properties f...
متن کاملJagged partitions and lattice paths
A lattice-path description of K-restricted jagged partitions is presented. The corresponding lattice paths can have peaks only at even x coordinate and the maximal value of the height cannot be larger than K − 1. Its weight is twice that of the corresponding jagged partitions. The equivalence is demonstrated at the level of generating functions. A bijection is given between K-restricted jagged ...
متن کاملGenerating trees for partitions and permutations with no k-nestings†
We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and restricted lattice walks, our approach deals directly with partition and permutation diagrams. We provide explicit functional equations for the generating functions...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2005
ISSN: 1077-8926
DOI: 10.37236/1909